On Huang and Wong’s algorithm for generalized binary split trees

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

Generalized Binary Search For Split-Neighborly Problems

In sequential hypothesis testing, Generalized Binary Search (GBS) greedily chooses the test with the highest information gain at each step. It is known that GBS obtains the gold standard query cost of O(log n) for problems satisfying the k-neighborly condition, which requires any two tests to be connected by a sequence of tests where neighboring tests disagree on at most k hypotheses. In this p...

Faster Construction of Optimal Binary Split Trees

A binary split tree is a search structure combining features of heaps and binary search trees. Building an optimal binary split tree was originally conjectured to be intractable due to di culties in applying dynamic programming techniques to the problem. However, two algorithms have recently been published which generate optimal trees in O(n5) time, for records with distinct access probabilitie...

Generalized Binary Search Trees and Clock Trees Revisited

In this paper, we study two diverse problems from a random matrix perspective. The first one is the problem of binary testing (or object/entity identification) that arises in applications such as active learning, fault diagnosis and computer vision, and the second is the problem of zero or bounded skew clock tree construction which arises in applications such as VLSI circuit design and network ...

A Note On Rémy's Algorithm For Generating Random Binary Trees